Estimating the φ(n) of Upper/Lower Bound in its RSA Cryptosystem
نویسندگان
چکیده
The RSA-768 (270 decimal digits) was factored by Kleinjung et al. on December 12 2009, and the RSA-704 (212 decimal digits) was factored by Bai et al. on July 2, 2012. And the RSA-200 (663 bits) was factored by Bahr et al. on May 9, 2005. Until right now, there is no body successful to break the RSA210 (696 bits) currently. In this paper, we would discuss an estimation method to approach lower/upper bound of φ(n) in the RSA parameters. Our contribution may help researchers lock the φ(n) and the challenge RSA shortly.
منابع مشابه
A Generalize Estimating the Ø(n) of Upper-Lower Bound to RSA Public Key Crytosystem
The RSA-768 (270 decimal digits) was factored by Kleinjung et al. on December 12, 2009, while the RSA-704 (212 decimal digits) was factored by Bai et al. on July 2, 2012. The RSA-200 (663 bits) was factored by Bahr et al. on May 9, 2005, while he RSA-210 (696 bits) was factored by Propper on September 26, 2013. In this paper the author will discuss an estimation method to approach the lower/upp...
متن کاملPetr Jančar FEI
1 RSA-cryptosystem, and the underlying theory The aim of this section is to recall the RSA cryptographic method and the necessary theory showing its correctness, computational complexity, etc. 1.1 Creating an RSA system RSA (Rivest, Shamir, Adleman) is a particular method which can be used for the public-key cryptography. A concrete RSA system is created as follows: 1. Choose randomly two diffe...
متن کاملSelected Topics of Theoretical Computer Science ( Vybrané partie z teoretické informatiky , 460 - 4043 ) Part
1 RSA-cryptosystem, and the underlying theory The aim of this section is to recall the RSA cryptographic method and the necessary theory showing its correctness, computational complexity, etc. 1.1 Creating an RSA system RSA (Rivest, Shamir, Adleman) is a particular method which can be used for the public-key cryptography. A concrete RSA system is created as follows: 1. Choose randomly two diffe...
متن کاملCorrectness of Li Generalization of RSA Cryptosystem
For given N=pq with p and q different odd primes and natural m Banghe Li introduced the public key cryptosystem [1]. In the case m=1 the system is just the famous RSA public key cryptosystem [2]. The cryptosystem is more secure in general [2] than RSA system. But one has to solve a few problems connected with the introduced cryptosystem. The cryptosystem works with elements of the quotient ring...
متن کاملEstimating Upper and Lower Bounds For Industry Efficiency With Unknown Technology
With a brief review of the studies on the industry in Data Envelopment Analysis (DEA) framework, the present paper proposes inner and outer technologies when only some basic information is available about the technology. Furthermore, applying Linear Programming techniques, it also determines lower and upper bounds for directional distance function (DDF) measure, overall and allocative efficienc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2012 شماره
صفحات -
تاریخ انتشار 2012